A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming
نویسندگان
چکیده
We prove a central limit theorem for a class of additive processes that arise naturally in the theory of finite horizon Markov decision problems. The main theorem generalizes a classic result of Dobrushin for temporally nonhomogeneous Markov chains, and the principal innovation is that here the summands are permitted to depend on both the current state and a bounded number of future states of the chain. We show through several examples that this added flexibility gives one a direct path to asymptotic normality of the optimal total reward of finite horizon Markov decision problems. The same examples also explain why such results are not easily obtained by alternative Markovian techniques such as enlargement of the state space.
منابع مشابه
Stochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملModerate Deviations for Time-varying Dynamic Systems Driven by Nonhomogeneous Markov Chains with Two-time Scales∗
Motivated by problems arising in time-dependent queues and dynamic systems with random environment, this work develops moderate deviations principles for dynamic systems driven by a fast-varying nonhomogeneous Markov chain in continuous time. A distinct feature is that the Markov chain is time dependent or inhomogeneous so are the dynamic systems. Under irreducibility of the nonhomogeneous Mark...
متن کاملCentral Limit Theorem for Hitting times of Functionals of Markov Jump Processes
A sample of i.i.d. continuous time Markov chains being defined, the sum over each component of a real function of the state is considered. For this functional, a central limit theorem for the first hitting time of a prescribed level is proved. The result extends the classical central limit theorem for order statistics. Various reliability models are presented as examples of applications. Mathem...
متن کاملThe Central Limit Theorem for the Normalized Sums of Extended Sliding Block Codes from Sequences of Markov Chains with Time Delay
We extend the sliding block code in symbolic dynamics to transform two sequences of Markov chains with time delay. Under the assumption that chains are irreducible and aperiodic, we prove the central limit theorem (CLT) for the normalized sums of extended sliding block codes from two sequences of Markov chains. We apply the theorem to evaluations of bit error probabilities in asynchronous sprea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 41 شماره
صفحات -
تاریخ انتشار 2016